Paired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
نویسندگان
چکیده
A paired many-to-many -disjoint path cover (paired -DPC) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants with ≥ and tori, and show that provided the number of faulty elements (vertices and/or edges) is or less, every nonbipartite recursive circulant and torus of degree has a paired -DPC for any and ≥ with ≤ .
منابع مشابه
Disjoint path covers in recursive circulants G(2m, 4) with faulty elements
A k-disjoint path cover of a graph is defined as a set of k internally vertexdisjoint paths connecting given sources and sinks in such a way that every vertex of the graph is covered by a path in the set. In this paper, we analyze the k-disjoint path cover of recursive circulant G(2m, 4) under the condition that at most f faulty vertices and/or edges are removed. It is shown that whenm ≥ 3, G(2...
متن کاملMany-to-Many Disjoint Path Covers in Two-Dimensional Bipartite Tori with a Single Vertex Fault
A paired many-to-many -disjoint path cover (-DPC for short) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of the graph is covered by a path. A two-dimensional × torus is a graph defined as the product of two cycles and of length and , respectively. In this paper, we deal with an × bipartite torus, even ≥ , with a single faul...
متن کاملMany-to-many two-disjoint path covers in cylindrical and toroidal grids
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...
متن کاملOre-type degree conditions for disjoint path covers in simple graphs
A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...
متن کاملA linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
For a connected graph G = (V (G), E(G)) and two disjoint subsets of V (G) A = {α1, . . . , αk} and B = {β1, . . . , βk}, a paired (many-to-many) k-disjoint path cover of G joining A and B is a vertex-disjoint path cover {P1, . . . , Pk} such that Pi is a path from αi to βi for 1 ≤ i ≤ k. In the recent paper [Disjoint Path Covers in Cubes of Connected Graphs, Discrete Mathematics 325 (2014) 65–7...
متن کامل